An analogue of the Gallai-Edmonds Structure Theorem for non-zero roots of the matching polynomial
نویسندگان
چکیده
Godsil observed the simple fact that the multiplicity of 0 as a root of the matching polynomial of a graph coincides with the classical notion of deficiency. From this fact he asked to what extent classical results in matching theory generalize, replacing “deficiency” with multiplicity of θ as a root of the matching polynomial. We prove an analogue of the Stability Lemma for any given root, which describes how the matching structure of a graph changes upon deletion of a single vertex. An analogue of Gallai’s Lemma follows. Together these two results imply an analogue of the GallaiEdmonds Structure Theorem. Consequently, the matching polynomial of a vertex transitive graph has simple roots.
منابع مشابه
Maximum Multiplicity of Matching Polynomial Roots and Minimum Path Cover in General Graphs
Let G be a graph. It is well known that the maximum multiplicity of a root of the matching polynomial μ(G,x) is at most the minimum number of vertex disjoint paths needed to cover the vertex set of G. Recently, a necessary and sufficient condition for which this bound is tight was found for trees. In this paper, a similar structural characterization is proved for any graph. To accomplish this, ...
متن کاملGeneralized D-graphs for nonzero roots of the matching polynomial
Recently, Bauer et al. (J Graph Theory 55(4) (2007), 343–358) introduced a graph operator D(G), called the D-graph of G, which has been useful in investigating the structural aspects of maximal Tutte sets in G with a perfect matching. Among other results, they proved a characterization of maximal Tutte sets in terms of maximal independent sets in the graph D(G) and maximal extreme sets in G. Th...
متن کاملOre, Berge–Tutte, and Gallai–Edmonds
We present a short proof of the Berge–Tutte Formula and the Gallai–Edmonds Structure Theorem based on Ore’s Defect Formula and Anderson’s proof of Tutte’s 1-Factor Theorem from Hall’s Theorem. The fundamental theorems on matchings in graphs have been proved in many ways, and generally they all imply each other. The most well-known is Hall’s Theorem [7] characterizing when a bipartite graph has ...
متن کاملExtensions of barrier sets to nonzero roots of the matching polynomial
In matching theory, barrier sets (also known as Tutte sets) have been studied extensively due to its connection to maximum matchings in a graph. In this paper, we first define θ-barrier sets. Our definition of a θ-barrier set is slightly different from that of a barrier set. However we show that θ-barrier sets and barrier sets have similar properties. In particular, we prove a generalized Berge...
متن کاملThe Third Proof of Lovász's Cathedral Theorem
This paper is on matching theory. A graph with perfect matching is called saturated if any addition of one complement edge creates a new perfect matching. Lovász gave a characterization of the saturated graphs called the cathedral theorem, and later Szigeti gave another proof. In this paper, we gave a new proof with our preceding works, which revealed the canonical structure of general graph wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 100 شماره
صفحات -
تاریخ انتشار 2010